11 research outputs found
Allocation in Practice
How do we allocate scarcere sources? How do we fairly allocate costs? These
are two pressing challenges facing society today. I discuss two recent projects
at NICTA concerning resource and cost allocation. In the first, we have been
working with FoodBank Local, a social startup working in collaboration with
food bank charities around the world to optimise the logistics of collecting
and distributing donated food. Before we can distribute this food, we must
decide how to allocate it to different charities and food kitchens. This gives
rise to a fair division problem with several new dimensions, rarely considered
in the literature. In the second, we have been looking at cost allocation
within the distribution network of a large multinational company. This also has
several new dimensions rarely considered in the literature.Comment: To appear in Proc. of 37th edition of the German Conference on
Artificial Intelligence (KI 2014), Springer LNC
Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus the total profit of all vertices not contained in the subtree. For this well-known problem we develop a new algorithmic framework consisting of three main parts: (1) An extensive preprocessing phase reduces the given graph without changing the structure of the optimal solution. (2) The central part of our approach is a memetic algorithm (MA) based on a steady-state evolutionary algorithm and an exact subroutine for the problem on trees. (3) The solution population of the memetic algorithm provides an excellent starting point for post-optimization by solving a relaxation of an integer linear programming (ILP) model constructed from a model for finding the minimum Steiner arborescence in a directed graph
Characterizing the Shapley value in fixed-route traveling salesman problems with appointments
Starting from her home, a service provider visits several customers, following a predetermined route, and returns home after all customers are visited. The problem is to find a fair allocation of the total cost of this tour among the customers served. A transferable-utility cooperative game can be associated with this cost allocation problem. We introduce a new class of games, which we refer as the fixed-route traveling salesman games with appointments. We characterize the Shapley value in this class using a property which requires that sponsors do not benefit from mergers, or splitting into a set of sponsors.Duygu Yengi
Cooperative games and cost allocation problems
Cooperative TU games, Cost allocation problems, Game practice, 91A12, 91A80,